Approximate Counting of Matchings in (3, 3)-Hypergraphs
نویسندگان
چکیده
We design a fully polynomial time approximation scheme (FPTAS) for counting the number of matchings (packings) in arbitrary 3-uniform hypergraphs of maximum degree three, referred to as (3, 3)hypergraphs. It is the first polynomial time approximation scheme for that problem, which includes also, as a special case, the 3D Matching counting problem for 3-partite (3, 3)-hypergraphs. The proof technique of this paper uses the general correlation decay technique and a new combinatorial analysis of the underlying structures of the intersection graphs. The proof method could be also of independent interest.
منابع مشابه
Approximate Counting of Matchings in Sparse Hypergraphs
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical path method to the case of uniform hypergraphs.
متن کاملCounting Hypergraph Matchings up to Uniqueness Threshold
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter λ, each matching M is assigned a weight λ|M |. The counting problem is formulated as computing a partition function that gives the sum of the weights of all matchings in a hypergraph. This problem unifies two extensively studied statistical...
متن کاملApproximate Counting of Matchings in Sparse Uniform Hypergraphs
In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of matchings in k-uniform hypergraphs whose intersection graphs contain few claws. Our method gives a generalization of the canonical path method of Jerrum and Sinclair to hypergraphs satisfying a local restriction. Our proof method depends on an application of the Euler tour technique for the canoni...
متن کاملMatchings and Tilings in Hypergraphs
We consider two extremal problems in hypergraphs. First, given k ≥ 3 and k-partite k-uniform hypergraphs, as a generalization of graph (k = 2) matchings, we determine the partite minimum codegree threshold for matchings with at most one vertex left in each part, thereby answering a problem asked by Rödl and Ruciński. We further improve the partite minimum codegree conditions to sum of all k par...
متن کاملComputing the Partition Function for Perfect Matchings in a Hypergraph
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V = S1 ∪ . . . ∪ Sm into pairwise disjoint k-subsets Si. When the weights wS are positive and within a constant factor, fixed in advance, of each other, we present a simple polynomial time algorithm to approximate the sum within a polynomial in m factor. ...
متن کامل